Frequency/Time Hopping Sequences with Large Linear Complexities
نویسندگان
چکیده
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF (p) by taking successive k-tuples of given sequences over GF (p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF (p) have the maximum possible linear complexities (LCs). Next, we consider the FH/TH sequence generators composed of a combinatorial function generator and some buffers. We are able to characterize the generators whose output FH/TH sequences over GF (p) have the maximum possible LC for the given algebraic normal form.
منابع مشابه
Chaotic frequency hopping sequences
This letter describes a novel family of frequency hopping sequences generated by chaotic systems. The sequences give a uniform spread over the entire frequency bandwidth. In addition to having good Hamming correlation properties, they possess ideal linear span. The sequences produce almost as good performance as random hopping patterns when used in frequency hopping code-division multiple-acces...
متن کاملConstruction of Frequency Hopping Sequence Set Based upon Generalized Cyclotomy
Frequency hopping (FH) sequences play a key role in frequency hopping spread spectrum communication systems. It is important to find FH sequences which have simultaneously good Hamming correlation,large family size and large period. In this paper, a new set of FH sequences with large period is proposed, and the Hamming correlation distribution of the new set is investigated. The construction of...
متن کاملDesign and Realization of an FPGA-Based Generator for Chaotic Frequency Hopping Sequences
Chaos-based pseudonoise (PN) sequences for spread spectrum (SS) communications ranks amongst the most promising applications of chaos to communications. This paper deals with the design and realization of a chaotic frequency hopping (FH) sequence generator that is compatible with current FH/SS technologies. A simplistic generator architecture adopting nonlinear auto-regressive (AR) filter struc...
متن کاملCyclically permutable codes
Brevity is the soul of wit. William Shakespeare A cyclically permutable code is a set of codewords having the property that no codeword is a cyclic shift of another codeword. We study the problem of constructing cyclically permutable codes of large size and low correlation. Cyclically permutable codes are used in code-division multiple-access systems realized by e.g. direct-sequence modulation ...
متن کاملUnified combinatorial constructions of optimal optical orthogonal codes
We present unified constructions of optical orthogonal codes (OOCs) using other combinatorial objects such as cyclic linear codes and frequency hopping sequences. Some of obtained OOCs are optimal or asymptotically optimal with respect to the Johnson bound. Also, we are able to show the existence of new optimal frequency hopping sequences (FHSs) with respect to the Singleton bound from our obse...
متن کامل